https://nova.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:11375 Sat 24 Mar 2018 08:11:55 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:28279 f(H') = Σ_v∈(H') f(v)+Σ_e∈(H') f(e) form an arithmetic progression with the initial term a and the common difference d. When f(V) = {1, 2,...,⏐V⏐}, then G is said to be super (a, d)-H-antimagic. In this paper, we study super (a, d)-H-antimagic labellings of a disjoint union of graphs for d = ⏐E(H)⏐ - ⏐V(H)⏐.]]> Sat 24 Mar 2018 07:41:22 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:26506 Sat 24 Mar 2018 07:35:33 AEDT ]]> https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:34916 antimagic labeling of G admitting an H-covering is a bijective function f : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} such that, for all subgraphs H' of G isomorphic to H, the H'-weights, et_f(H') = Σ_υ∈V(H')f(υ)+Σ_e∈E(H')F(e), constitute an arithmetic progression with the initial term a and the common difference d. Such a labeling is called super if f(V) = {1, 2, ..., ∣V∣}. In this paper, we study the existence of super (a, d)-H-antimagic labelings for graph operation G^H, where G is a (super) (b, d*)-edge-antimagic total graph and H is a connected graph of order at least 3.]]> Fri 06 Oct 2023 15:46:50 AEDT ]]>